Fixed-Lag Smoothing Algorithm under Non-independent Uncertainty
نویسندگان
چکیده
This paper discusses the least-squares linear filtering and fixed-lag smoothing problems of discrete-time signals from uncertain observations when the random interruptions in the observation process are modelled by a sequence of not necessarily independent Bernoulli variables. It is assumed that the observations are perturbed by white noise and the autocovariance function of the signal is factorizable. Using an innovation approach we obtain the filtering and fixed-lag smoothing recursive algorithms, which do not require the knowledge of the state-space model generating the signal. Besides the observed values, they use only the matrix functions defining the factorizable autocovariance function of the signal, the noise autocovariance function, the marginal probabilities and the (2, 2)element of the conditional probability matrices of the Bernoulli variables. The algorithms are applied to estimate a scalar signal which may be transmitted through one of two channels. key words: filtering, fixed-lag smoothing, covariance information, uncertain observations
منابع مشابه
On the Stability of a Fixed Lag Smoother
The first. fixed lag smoothing algorithm mas developed by Rauch [I] as an extension to the fixed interval smoothing algorithm 121. Meditch [3] rederived t.he result,s of [I] using orthogonal project,ion. He conjectured that the h e d lag smoot.her [l], [3] would be asymptotically stable under the usual condit.ions which guarantee asymptotic stability of the Kalman filter. However, Kailath and F...
متن کاملFixed-point smoothing with non-independent uncertainty using covariance information
Recursive filtering and fixed-point smoothing algorithms, using covariance information, are designed in systems with uncertain observations, when the variables describing the uncertainty are not necessarily independent. It is assumed that the observations are perturbed by white plus coloured noises, and the autocovariance functions of the signal and coloured noise are given in a semidegenerate ...
متن کاملA d-step Fixed-lag Smoothing Algorithm for Markovian Switching Systems
* Research supported in part by National Nature Science Foundation of China Abstract A suboptimal approach to the d( 0 d ≥ ) step fixed-lag smoothing problem for Markovian switching systems is presented. Multiple Model Estimation techniques have been widely used in solving state estimation problems of these systems. We demonstrated that the mode probability of each fixed-lag smoother at time k-...
متن کاملH∞ Fixed-Lag Smoothing for Descriptor Systems
In this paper, we study the finite horizon H∞ fixed-lag smoothing problem for linear descriptor systems. The key approach applied for deriving the H∞ fixed-lag smoother is the re-organization innovation analysis in Krein space. Under the Krein space, the H∞ fixed-lag smoothing is converted into an H2 estimation problem for the system with current and delayed measurements. By using innovation re...
متن کاملA Fixed-lag Smoothing Solution to Out-of-sequence Information Fusion Problems∗
Multi-sensor tracking using delayed, out-of-sequence Information (OOSI) is a problem of growing importance due to an increased reliance on networked sensors interconnected via complex communication network architectures. In such systems, it is often the case that information (in the form of raw or processed measurements) is received out-of-time-order at the fusion center. Owing to compatibility...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 88-A شماره
صفحات -
تاریخ انتشار 2005